State merging and state splitting via state assignment: a new FSM synthesis algorithm
نویسندگان
چکیده
منابع مشابه
State merging and state splitting via state assignment: a new FSM synthesis algorithm - Computers and Digital Techniques, IEE Proceedings-
In the paper the authors describe a state assignment algorithm for FSMs which produces an assignment of non-necessarily distinct, and eventually, incompletely specified codes. In this new approach, state reduction and state assignment are dealt with concurrently, and a restricted state splitting technique is explored. The algorithm is particularly appropriate for machines with compatibility rel...
متن کاملGALLOP: Genetic Algorithm based Low Power FSM Synthesis by Simultaneous Partitioning and State Assignment
Partitioning has been shown to be an effective method for synthesis of low power finite state machines. In this approach, an FSM is partitioned into two or more coupled sub-machines such that most of the time only one of the sub-machines is active. In this paper, we present a GA based approach for simultaneous partitioning and state assignment of finite state machines with power reduction as th...
متن کاملState Assignment for Finite State Machine Synthesis
This paper proposes simulated annealing based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipation. The algorithm has two annealing stages. In the first rough annealing stage it tries to search in global scope by the proposed rough search method. In the second focusing annealing stage it tries to search in local sco...
متن کاملA Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines. High performance CAD tools are necessary to overcome the computational complexity involved in the optimization of large sequential circuits. FSMs constitute an important class of logic circuits and state assignment is one of the key steps in combinational logic optimi...
متن کاملA Parallel Algorithm for State Assignment of Finite State Machines
Optimization of huge sequential circuits has become unmanageable in CAD of VLSI due to enormous time and memory requirements. In this paper, we report a parallel algorithm for the state assignment problem for nite state machines. Our algorithm has three sig-niicant contributions: It is an asynchronous parallel algorithm portable across diierent MIMD machines. Time and memory requirements reduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEE Proceedings - Computers and Digital Techniques
سال: 1994
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19941228